Arithmetic constraints of polynomial maps through discrete logarithms
نویسندگان
چکیده
Let q be a prime power, let Fq the finite field with elements and ? generator of cyclic group Fq?. For each a?Fq?, log??a unique integer i?{1,…,q?1} such that a=?i. Given polynomials P1,…,Pk?Fq[x] divisors 1<d1,…,dk q?1, we discuss distribution functionsFi:y?log??Pi(y)(moddi), over set Fq??i=1k{y?Fq|Pi(y)=0}. Our main result entails that, under natural multiplicative condition on pairs (di,Pi), functions Fi are asymptotically independent. We also provide some applications in particular, relates to past work.
منابع مشابه
Arithmetic of Unicritical Polynomial Maps
with derivative g b(w) = w n−1 , and use the conjugacy invariant b̂ = b . These normal forms (0.1) and (0.2) are related by the change of variable formula w = nz with b̂ = nĉ , and hence b = nc . (In particular, in the degree two case, b = b̂ is equal to 4c = 4ĉ .) If A is any ring contained in the complex numbers C , it will be convenient to use the non-standard notation A for the integral closur...
متن کاملSolving the discrete logarithms in quasi-polynomial time
The discrete logarithm has similar algebraic properties as for logarithm in reals. Namely, logg(hh ′) = logg(h) + logg(h ′). The discrete logarithm problem is also randomly self-reducible. This means that there are no “difficult” problems. If there would be an element h in the group for which the logarithm is hard to solve, then it is possible to take 1 ≤ x ≤ q, where q is the order of the grou...
متن کاملDiscrete Logarithms: Recent Progress
We summarize recent developments on the computation of discrete logarithms in general groups as well as in some specialized settings. More specifically , we consider the following abelian groups: the multiplicative group of nite elds, the group of points of an elliptic curve over a nite eld, and the class group of quadratic number elds.
متن کاملElementary Thoughts on Discrete Logarithms
Given a cyclic group G with generator g, and given an element t in G, the discrete logarithm problem is that of computing an integer l with g = t. The problem of computing discrete logarithms is fundamental in computational algebra, and of great importance in cryptography. In this lecture we shall examine how sometimes the problem may be reduced to the computation of discrete logarithms in smal...
متن کاملDiscrete Logarithms in Generalized Jacobians
Déchène has proposed generalized Jacobians as a source of groups for public-key cryptosystems based on the hardness of the Discrete Logarithm Problem (DLP). Her specific proposal gives rise to a group isomorphic to the semidirect product of an elliptic curve and a multiplicative group of a finite field. We explain why her proposal has no advantages over simply taking the direct product of group...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2021
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2020.10.015